A structured approach to design-for-frequency problems using the Cayley-Hamilton theorem
نویسندگان
چکیده
An inverse eigenvalue problem approach to system design is considered. The Cayley-Hamilton theorem is developed for the general case involving the generalized eigenvalue vibration problem. Since many solutions exist for a desired frequency spectrum, a discussion of the required design information and suggestions for including structural constraints are given. An algorithm for solving the inverse eigenvalue design problem using the generalized Cayley-Hamilton theorem is proposed. A method for solving partially described systems is also specified. The Cayley-Hamilton theorem algorithm is shown to be a good design tool for solving inverse eigenvalue problems of mechanical and structural systems.
منابع مشابه
On the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملA combinatorial approach to hypermatrix algebra
We present a formulation of the Cayley-Hamilton theorem for hypermatrices in conjunction with the corresponding combinatorial interpretation. Finally we discuss how the formulation of the Cayley-Hamilton theorem for hyermatrices leads to new graph invariants which in some cases results in symmetry breakings among cospectral graphs.
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملOn the Computation of the Minimal Polynomial of a Polynomial Matrix
It is well known from the Cayley Hamilton theorem that every matrix A ∈ Rr×r satisfies its characteristic equation (Gantmacher, 1959), i.e., if p (s) := det (sIr −A) = sr+p1sr−1+· · ·+pr, then p (A) = 0. The Cayley Hamilton theorem is still valid for all cases of matrices over a commutative ring (Atiyah and McDonald, 1964), and thus for multivariable polynomial matrices. Another form of the Cay...
متن کامل0 D ec 1 99 9 Q - multilinear Algebra
The Cayley-Hamilton-Newton theorem which underlies the Newton identities and the Cayley-Hamilton identity is reviewed, first, for the classical matrices with commuting entries, second, for two q-matrix algebras, the RTTalgebra and the RLRL-algebra. The Cayley-Hamilton-Newton identities for these q-algebras are related by the factorization map. A class of algebras M(R̂, F̂ ) is presented. The alge...
متن کامل